Approximation Algorithms in the Successive Hitting Set Model
نویسنده
چکیده
We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and experimentally investigate, several scenarios where the new model is beneficial compared to the conventional one.
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملApproximation algorithms for hitting objects with straight lines
In the hitting set problem one is given m subsets of a nite set N and one has to nd an X N of minimum cardinality that hits intersects all of them The problem is NP hard It is not known whether there exists a polynomial time approximation algorithm for the hitting set problem with a nite performance ratio Special cases of the hitting set problem are described for which nite performance ratios a...
متن کاملApproximation Algorithms
In the hitting set problem one is given m subsets of a nite set N and one has to nd an X N of minimum cardinality that \hits" (intersects) all of them. The problem is NP-hard. It is not known whether there exists a polynomial-time approximation algorithm for the hitting set problem with a nite performance ratio. Special cases of the hitting set problem are described for which nite performance r...
متن کاملAn Adaptive Approach to Increase Accuracy of Forward Algorithm for Solving Evaluation Problems on Unstable Statistical Data Set
Nowadays, Hidden Markov models are extensively utilized for modeling stochastic processes. These models help researchers establish and implement the desired theoretical foundations using Markov algorithms such as Forward one. however, Using Stability hypothesis and the mean statistic for determining the values of Markov functions on unstable statistical data set has led to a significant reducti...
متن کامل